New algorithm for learning languages

Cornell University and Tel Aviv University researchers have developed a method for enabling a computer program to scan text in any of a number of languages, including English and Chinese, and autonomously and without previous information infer the underlying rules of grammar. The rules can then be used to generate new and meaningful sentences. The method also works for such data as sheet music or protein sequences.

The development — which has a patent pending — has implications for speech recognition and for other applications in natural language engineering, as well as for genomics and proteomics. It also offers new insights into language acquisition and psycholinguistics.

“The algorithm — the computational method — for language learning and processing that we have developed can take a body of text, abstract from it a collection of recurring patterns or rules and then generate new material,” explained Shimon Edelman, a computer scientist who is a professor of psychology at Cornell and co-author of a new paper, “Unsupervised Learning of Natural Languages,” published in the Proceedings of the National Academy of Sciences (PNAS, Vol. 102, No. 33).

“This is the first time an unsupervised algorithm is shown capable of learning complex syntax, generating grammatical new sentences and proving useful in other fields that call for structure discovery from raw data, such as bioinformatics,” he said.

Unlike previous attempts at developing computer algorithms for language learning, the new method, called Automatic Distillation of Structure (ADIOS), successfully identifies complex patterns in raw texts. The algorithm discovers the patterns by repeatedly aligning sentences and looking for overlapping parts.

For example, the sentences I would like to book a first-class flight to Chicago, I want to book a first-class flight to Boston and Book a first-class flight for me, please may give rise to the pattern book a first-class flight — if this candidate pattern passes the novel statistical significance test that is the core of the algorithm.

If the system also encounters the sentences I need to book a direct flight from New York to Tel Aviv andI would like to book an economy flight , it may infer that the phrases first-class, direct and economy are equivalent in the context of the new pattern. “Because such equivalence sets can contain other patterns — in turn containing further patterns, and so on — the resulting body of knowledge grows recursively, as a sort of forest of branching trees of possibilities,” said Edelman.

He added, “ADIOS relies on a statistical method for pattern extraction and on structured generalization — two processes that have been implicated in language acquisition. Our experiments show that it can acquire intricate structures from raw data, including transcripts of parents’ speech directed at 2- or 3-year-olds. This may eventually help researchers understand how children, who learn language in a similar item-by-item fashion and with very little supervision, eventually master the full complexities of their native tongue.”

In addition to child-directed language, the algorithm has been tested on the full text of the Bible in several languages, on artificial context-free languages with thousands of rules and on musical notation. It also has been applied to biological data, such as nucleotide base pairs and amino acid sequences. In analyzing proteins, for example, the algorithm was able to extract from amino acid sequences patterns that were highly correlated with the functional properties of the proteins.

The new method was developed jointly with David Horn and Eytan Ruppin, professors of physics and computer science, respectively, at Tel Aviv University, and with Zach Solan, a doctoral student there and the lead author on the paper. Their collaboration with Edelman was supported in part by the U.S.-Israel Binational Science Foundation.

From Cornell University

The material in this press release comes from the originating research organization. Content may be edited for style and length. Have a question? Let us know.


One email, each morning, with our latest posts. From medical research to space news. Environment to energy. Technology to physics.

Thank you for subscribing.

Something went wrong.

43 thoughts on “New algorithm for learning languages”

  1. Yes it’s pity but it is so:(
    Search engines become smarter only because spa*mers getting smarter and invent such linguistic tools.

  2. create program , that can easily generate texts with content, that answers exactly to human’s questions. I think it’ll be possible, when smth about background knowledge will be created.

  3. Well this is interesting I imagine the algorithm is in some version of C+ or something. There was once three or four competing lists of rules for English syntax, about 33 or so, so this is a good thing for computers to do, so to speak, sort of a real-time syntactical concordance analyses.

  4. I once studied syntax and transformational grammar at Stony Brook University, along with other linguistic classes for Anthropology and find this an interesting development. When computer languages got started there was one SNOBOL which processed language, instead of numbers, which I thought might some day be developed, why even Bill Gates once promised a SNOBOL for Windows. (Where is it Mr. Gates?) Well this is interesting I imagine the algorithm is in some version of C+ or something. There was once three or four competing lists of rules for English syntax, about 33 or so, so this is a good thing for computers to do, so to speak, sort of a real-time syntactical concordance analyses. Bravo!

    George J Myers, Jr. (my first post here, I’m awed)

Comments are closed.