Sciweavers

341 search results - page 24 / 69
» Formal Grammars of Early Language
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 7 months ago
Precedence Automata and Languages
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...
Violetta Lonati, Dino Mandrioli, Matteo Pradella
MICAI
2004
Springer
15 years 4 months ago
Automatic Enrichment of Very Large Dictionary of Word Combinations on the Basis of Dependency Formalism
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...
Alexander F. Gelbukh, Grigori Sidorov, Sang-Yong H...
TSD
2004
Springer
15 years 4 months ago
Building a Dependency-Based Grammar for Parsing Informal Mathematical Discourse
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...
Magdalena Wolska, Ivana Kruijff-Korbayová
CPP
2011
107views more  CPP 2011»
13 years 10 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
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...
Tom Ridge
EACL
1993
ACL Anthology
15 years 10 days ago
Type-Driven Semantic Interpretation of f-Structures
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...
Jürgen Wedekind, Ronald M. Kaplan