Analysis

@article{Morrisson2004Analysis,
  title={Analysis},
  author={Stephen Morrisson and Marion Kee and Kenneth Goodman},
  journal={Machine Translation},
  year={2004},
  volume={4},
  pages={113-128}
}
This paper describes the parser, especially its mapping rule interpreter, used in KBMT-89. The interpreter is characterized by its ability to produce semantic and syntactic structures of a parse simultaneously and therefore more efficiently than other kinds of analyzers. Applicable forms of parser mapping rules, which map syntactic structures to semantic structures, are introduced. The parser, a modified version of Tomita's universal parser, is briefly described. Sample traces illustrate the… Expand

Tables and Topics from this paper

Formal Linguistics and the Deductive Grammar
  • Yingxu Wang
  • Computer Science
  • 6th IEEE International Conference on Cognitive Informatics
  • 2007
TLDR
A universal language processing model and the deductive grammar of English are developed toward the formalization of the universal grammar proposed in linguistics. Expand
Can a Many-Valued Language Functionally Represent its own Semantics?
An argument like the one used in the proof of Thm. 4.7 can be applied in a wide variety of cases. ... This suggests that there cannot exist a formal language which under some 'standard'Expand
On Constructive Connectives and Systems
TLDR
A general non-deterministic Kripke-style semantics is provided, which is used to provide a constructive, sufficient and necessary coherence criterion for the validity of the strong cut-elimination theorem in a canonical inference rules and canonical systems system. Expand
HMM-based prosodic structure model using rich linguistic context
TLDR
High-level syntactical features are shown to significantly improve the performance of the model (up to 21% error reduction combined with 19% BIC reduction) and are compared on the basis of a HMM-based prosodic structure model. Expand
Persistence, Change, and the Integration of Objects and Processes in the Framework of the General Formal Ontology
TLDR
An approach which interprets persistence as a phenomenon emanating from the activity of the mind, and which, additionally, postulates that persistence, finally, rests on personal identity is proposed. Expand
Relevance and Conjunction
  • E. Mares
  • Mathematics, Computer Science
  • J. Log. Comput.
  • 2012
TLDR
An interpretation and justification of extensional and intensional conjunction in the relevant logic R. R. Mares' natural deduction system and the theory of situated inference from Mares, Relevant Logic is given. Expand
Possible-Worlds Semantics for Modal Notions Conceived as Predicates
TLDR
This work presents sufficient and necessary conditions for the existence of a suitable interpretation of □ at any world and presents sound and complete semi-formal systems, corresponding to the modal systems K and K4, for the class of all possible-worlds models for predicates and all transitive possible- WORLD models. Expand
On tests of context
The semantical device of the ‘test of context’ may be of considerable philosophical significance. In a nutshell, the idea is this. Perhaps ‘I believe that P’ is a test of context. What that wouldExpand
MODELING RELATIONS
  • Joop Leo
  • Computer Science
  • J. Philos. Log.
  • 2008
TLDR
In this paper mathematical models for relations are developed that provide more insight into the structure of relations “out there” in the real world. Expand
DESIGN OF MUTANT OPERATORS FOR THE C PROGRAMMING LANGUAGE
TLDR
This report describes the mutant operators designed for the proposed ANSI C programming language and intends this report to serve as a manual for the C mutant operators for researchers in software testing. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
The Universal Parser Architecture for Knowledge-based Machine Translation
TLDR
The universal parser provides principled run-time integration of syntax and semantics, while preserving the generality of domain-independent syntactic grammars, and language-independent domain knowledge bases; the optimized cross product is generated automatically in the precornpllation phase. Expand
Parsing Spoken Language: a Semantic Caseframe Approach
TLDR
This paper describes an extension of semantic caseframe parsing to restricted-domain spoken input, and applies the caseframe grammar in a quite different way, emphasizing island growing from caseframe headers. Expand
Lexical Functional Grammar A Formal System for Grammatical Representation
TLDR
This work has adopted the Competence Hypothesis as a methodological principle, and assumes that an explana tory model of human language performance will incorporate a theoreti cally justi ed representation of the native speaker s linguistic knowledge a grammar as a component separate both from the computational mech anisms that operate on it a processor and from other nongrammatical processing parameters that might in uence the processor s behavior. Expand
FRAMEKIT User’s Guide
  • Technical Memo, Center for Machine Translation, Carnegie Mellon University. Tomita, M. 1985. Efficient Parsing for Natural Language. Boston: Kluwer. Tomita, M., and J.G. Carbonell. 1987. The Universal Parser Architecture for Knowledge-Based Machine Translation. Technical Report, Center for Machine T
  • 1988
Pseudo Unification and Full Unification
  • Technical Memo, Center for Machine Translation, Carnegie Mellon University. Tomita, M., M. Kee, and T. Mitamura. 1987. Three Kinds of Knowledge Sources for the Universal Parser. In Proceedings of the International Conference on Terminology and Knowledge Representation. Trier.
  • 1988
The Generalized LR Parser/Compiler Version 8.1: User’s Guide
  • 1988
Three Kinds of Knowledge Sources for the Universal Parser
  • 1987
Analog denieren wir lokale Minima
    Ein x ∈ R n heiÿt lokales Maximum von f , falls es ein ε > 0 gibt, sodass gilt: f (x ) ≥ f (x) für alle x ∈ B ε (x )
      Existieren alle partiellen Ableitungen und sind diese darüber hinaus stetig, dann ist die Funktion f : R n → R auch total dierenzierbar. Total dienrenzierbare Funktionen sind selbst stetig
      • Bemerkung
      ...
      1
      2
      ...