Harri Jäppinen

According to our database, Harri Jäppinen authored at least 16 papers between 1981 and 1989.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1989

Automatic Translation of a Highly Constrained Language.

Leo Kulikov, Harri Jäppinen

Proceedings of the Second Scandinavian Conference on Artificial Intelligence 1989, 1989

1988

Inflections and Compounds : Linguistic Problems for Automatic Indexing.

Harri Jäppinen, J. Niemistö

Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications), 1988

Task Oriented Knowledge Representation Languages for NLP-Systems.

Aarno Lehtola, Timo Honkela, Heikki Hyötyniemi, Harri Jäppinen

Proceedings of the Methodologies for Intelligent Systems, 1988

Locally governed trees and dependecy parsing.

Harri Jäppinen, Eero Lassila, Aarno Lehtola

Proceedings of the 12th International Conference on Computational Linguistics, 1988

1987

Blackboard-based Dependency Parsing.

K. Valkonen, Harri Jäppinen, Aarno Lehtola

Proceedings of the 10th International Joint Conference on Artificial Intelligence. Milan, 1987

Declarative Nodel For Dependency Parsing - A View Into Blackboard Methodology.

K. Valkonen, Harri Jäppinen, Aarno Lehtola, Matti Ylilammi

Proceedings of the EACL 1989, 1987

1986

Associative Model of Morphological Analysis: An Empirical Inquiry.

Harri Jäppinen, Matti Ylilammi

Comput. Linguistics, 1986

Functional Structures for Parsing Dependency Constraints.

Harri Jäppinen, Aarno Lehtola, K. Valkonen

Proceedings of the 11th International Conference on Computational Linguistics, 1986

1985

FINNTEXT: Text retrieval system for an agglutinative language.

Harri Jäppinen, J. Niemistö, Matti Ylilammi

Proceedings of the Computer-Assisted Information Retrieval (Recherche d'Information et ses Applications), 1985

Language-Based Environment For Natural Language Parsing.

Aarno Lehtola, Harri Jäppinen, Esa Nelimarkka

Proceedings of the EACL 1985, 1985

1984

Parsing an Inflectional Free Word Order Language with Two-Way Finite Automata.

Esa Nelimarkka, Harri Jäppinen, Aarno Lehtola

Proceedings of the Advances in Artificial Intelligence, 1984

Two-Way Finite Automata And Dependency Grammar: A Parsing Method For Inflectional Free Word Order Languages.

Esa Nelimarkka, Harri Jäppinen, Aarno Lehtola

Proceedings of the 10th International Conference on Computational Linguistics and 22nd Annual Meeting of the Association for Computational Linguistics, 1984

1983

A Computational Model of Finnish Sentence Structure.

Esa Nelimarkka, Harri Jäppinen, Aarno Lehtola

Proceedings of the 4th Nordic Conference of Computational Linguistics, 1983

Knowledge Engineering Applied to Morphological Analysis.

Harri Jäppinen, Aarno Lehtola, Esa Nelimarkka, Matti Ylilammi

Proceedings of the 4th Nordic Conference of Computational Linguistics, 1983

Knowledge Engineering Approach To Morphological Analysis.

Harri Jäppinen, Aarno Lehtola, Esa Nelimarkka, Matti Ylilammi

Proceedings of the EACL 1983, 1983

1981

Sense-controlled flexible robot behavior.

Harri Jäppinen

Int. J. Parallel Program., 1981