341 search results - page 24 / 69 » Formal Grammars of Early Language |
151
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
133
click to vote
MICAI
2004
Springer
15 years 11 months ago
2004
Springer
The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sen...
139
click to vote
TSD
2004
Springer
15 years 11 months ago
2004
Springer
Discourse in formal domains, such as mathematics, is characterized by a mixture of telegraphic natural language and embedded formal expressions. Little is known about the suitabil...
223
click to vote
CPP
2011
14 years 5 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
155
click to vote
EACL
1993
ACL Anthology
15 years 7 months ago
1993
ACL Anthology
The formal architecture of Lexical Functional Grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a...