110 search results - page 16 / 22 » Finite-State Registered Automata and Their Uses in Natural L... |
EMNLP
2011
13 years 9 months ago
2011
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
FSMNLP
2005
Springer
15 years 3 months ago
2005
Springer
Compounding is a very productive process in German to form complex nouns and adjectives which represent about 7% of the words of a newspaper text. Unlike English, German compounds ...
UML
2001
Springer
15 years 2 months ago
2001
Springer
Sequence Diagrams (SDs) have proven useful for describing transaction-oriented systems, and can form a basis for creating statecharts. However, distributed embedded systems require...
CAV
1999
Springer
15 years 1 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...