Logic based lexical analyser LAX
This paper describes a method of Japanese morphological analysis which runs in a sequential or parallel logic programming language. In the method presented here, a morphological dictionary is compiled into a logic program which executes lexical analysis deterministically.
Morphemes and their categories are written in a morphological dictionary. The categories are used as inputs to a non-deterministic finite state automaton (NFSA).
The dictionary is compiled into a TRIE structure in which morphemes can be quickly looked up using an index search mechanism such as those provided in logic programming languages like ESP or Prolog.
The layered stream technique, which records search space in recursively structured data, is applied in analysis. All solutions are given at the end of analysis. The analysis output can be used as input to the syntactic analyser, SAX, which can also be executed in parallel logic languages.
This method can process unknown morphemes which are not in the dictionary in linear order. This paper also reports the evaluation of this method in sequential languages.
Unable to display preview. Download preview PDF.
- Akasaka, K., Sugimura, R. and Matsumoto, Y., “Chikuji Shorikei-jô deno LAX no Mondai-ten to sono Kaiketsu-hô” (“Problems in LAX in sequential implimentation, and their Solutions” (in Japanese)), Proceedings of the 35th Conference of Information Processing Society of Japan, pp.1355–1356, 1987Google Scholar
- Aizawa, T. and Ebara, T., “Mechanical Translation System of Kana Representations to Kanji-kana Mixed Representations” (in Japanese), NHK Gijutsu-Kenkyû, Vol.25 No.5, pp.23–60, 1973Google Scholar
- Kamiwaki, T. and Tanaka, H., “Jisho no TRIE Kôzô-ka to Jukugo Shori” (“Idiom Handling Using the TRIE Structure Dictionary” (in Japanese)), Proceedings of the Logic Programming Conference '85, pp.329–340, 1988Google Scholar
- Kay, M., “Algorithm Schemata and Data Structures in Syntactic Processing”, Technical Report, CSL-80-12, XEROX PARC., Oct. 1980Google Scholar
- Mizutani, S., “Kokubunpô Shibyô” (“Sketch of Japanese Grammars” (in Japanese)), Bunpô to Imi I, Asakura Nihongo Kôza No.3, Asakura Shoten, 1983Google Scholar
- Okumura, K. and Matsumoto, Y., “Layered Stream wo Mochiita Heiretsu Pogramming” (“Parallel Programming using Layered Stream” (in Japanese)), Proceedings of the Logic Programming Conference '87, pp223–232, 1987Google Scholar
- Sugimura, R., Akasaka, K. and Matsumoto, Y., “Heiretsu Keitaiso Kaiseki System LAX no Jitsugen” (“Imprementation of Parallel Morphological Analyser LAX” (in Japanese)), Proceedings of the 35th Conference of Information Processing Society of Japan, pp.1323–1324, 1987Google Scholar
- Ueda K., Guarded Horn Clauses, ICOT Technical Report No.103, 1985Google Scholar
- Earley, J., “An Efficient Context-free Parsing Algorithm”, CACM, Vol13, No.2, pp.94–102, 1970Google Scholar
- Matsumoto,Y and Sugimura, R., “Ronri-gata Gengo ni Motozuku Kôbun Kaiseki System SAX” (“Logic Programming Based Parser SAX” (in Japanese)), Computer Software, Vol3, No.4, 1986Google Scholar
- Yoshimura,K., Hidaka, I. and Yoshida, S., “Nihon-go Bun no Keitaisokaiseki ni okeru Saichô-itchi-hô to Bunsetsu-sû Saishôhô nitsuite” (“Saichô-itchi and Bunsetsu-sû Saishô-hô in Morphological analysis “(in Japanese)), IPSJ-NLU 30-7, 1982Google Scholar
- Morioka, K., “Goi no Keisei” (“Formation of a Vocabulary” (in Japanese)) Gendai-go Kenkyû Series 1, Meiji-Shoin, 1987Google Scholar
- Sano, H., Akasaka, K., Kubo, Y., and Sugimura, R., “Go-Kôsei ni Motozuku Keitaiso Kaiseki” (“Morphological Analysis with Derivation and Inflection” (in Japanese)), Proceedings of the 36th Conference of Information Processing Society of Japan, 1988Google Scholar
- Mukai K., A System of Logic Programming for Linguistic Analysis Based on Situation Semantics, Proceedings of the Workshop on Semantic Issues in Human and Computer Languages. Half Moon Bay. CSLI 1987Google Scholar