You are not logged in.
Pages: 1
I have never studied languages but some day I may study the mathematics of languages. This paper looks interesting.
http://delivery.acm.org/10.1145/990000/ … 89513]SOME COMPUTATIONAL PROPERTISS
OF TREE ADJOINING GRAMM
lnvestigatiou of constrained grammatical system from the
point of view of their linguistic &leqnary and their computational
tractability has been a mnjor concern of computational linguists for
the last several years. Generalized Phrase Structure grammars
(GPSG), Lexical Functional grunmmm (LFG), Phrm~ Linking
grammars (PLG), and Tree Adjoining grammars (TAG) are some
key examples of grammatical systems that have been and still
continue to be investignted along theme lines.
Dig into the [url=http://child-civilization.blogspot.com/2006/12/political-grab-bag.html]political grab bag[/url] at [url=http://child-civilization.blogspot.com/]Child Civilization[/url]
Offline
Like button can go here
Pages: 1