896 search results - page 25 / 180 » On completeness of word reversing |
JSC
2010
14 years 11 months ago
2010
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
93
Voted
TSD
2000
Springer
15 years 4 months ago
2000
Springer
In this article, we present a test environment for a word analysis system that is used for reliable and sense-conveying hyphenation of German words. A crucial task is the hyphenati...
112
Voted
TCS
2008
15 years 17 days ago
2008
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we...
ACL
1998
15 years 2 months ago
1998
One area in which artificial neural networks (ANNs) may strengthen NLP systems is in the identification of words under noisy conditions. In order to achieve this benefit when spel...
97
Voted
RTA
1991
Springer
15 years 4 months ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...