Is it possible to quantify human language?

  • Thread starter Thread starter EighthGrader
  • Start date Start date
  • Tags Tags
    Human Language
EighthGrader
Messages
11
Reaction score
0
While listening on my english lecture, my teacher told us that authors usually have similar word choices and sentences structures on their writings.

Because of that, I began to wonder if it is possible (if it hasn't been done already) to quantify the human language (if that's the right term for it). The reason I ask is maybe it is possible to compare two or more pieces of writing quantitatively through a computer and see if it is from the same author based from its (unique) word and sentence structures?
 
Mathematics news on Phys.org
This kind of analysis has been going on for a long time. The use of computers speeds up the process, but the concept long predates their use. One important example is breaking down the five books of Moses (19th century) into four major sources.
 
What you're talking about is called "stylometry." I don't vouch for it because I haven't used it, but if you have the inclination, you can goof around with a freeware program called Signature that employs these techniques to determine authorship. It comes packaged with a copy of the Federalist Papers to help you learn how to use it. This paper gives a general overview of the history and status of authorship attribution.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top