Arvind Joshi
| Birth | Pune , India |
|---|---|
| Death | Philadelphia |
| Residence | Philadelphia , PA, USA |
| Areas | Computational linguistics |
| institutions | University of Pennsylvania |
| Training | Pune College of Engineering , Indian Institute of Science , University of Pennsylvania |
| Renowned for | Formalism of Adjoining Tree Grammars |
| Site | Arvind Joshi's personal page |
Arvind Krishna Joshi, born onin Pune , India and died on in Philadelphia , was a scholar of computational linguistics , known for defining the formalism of the adjoint tree grammars used in computational linguistics and automatic natural language processing . Arvind Joshi was a Henry Salvatori Professor of Computer Science and Cognitive Science in the Department of Computer Science at the University of Pennsylvania .
Professional career
Joshi studied at the University of Pune and the Indian Institute of Science . He obtained respectively a bachelor's degree in engineering, electrical engineering , and a master's degree in communications engineering. He then worked as an engineer at RCA in Camden, New Jersey, from 1954 to 1958, while working on another master's degree in electrical engineering at the University of Pennsylvania.
He was then a research assistant in linguistics at the university from 1958 to 1960, and in 1960 he obtained a doctorate in electrical engineering. He was appointed assistant professor, then associate professor in the electrical engineering department until 1972, when a computer science and information science department was created.
He took over as full professor, a position he held until 1985. In 1979 he co-founded, with the psycholinguist Lila Gleitman, the cognitive science research institute at the University of Pennsylvania.
In 1983, he was awarded the Henry Salvatori Chair in Computer Science and Cognitive Sciences. National Science Foundation Science and Technology Center for research in cognitive sciences, co-directed by Arvind Joshi until 2001. This center is a unique institution, characterized by a strong interaction between computer science, linguistics and psychology.
Scientific work
Arvind Joshi has worked in formal language theory, parsing and generation, tree automata, partial information logics, natural language interfaces to information systems, the grammar of long-range dependencies, extraposition , nested and cross dependencies , the coordination and even the mixing of code, a kind of speech that occurs when one begins a sentence in a lange and ends there in una otra.
Arvind Joshi has made fundamental contributions to computational linguistics in two directions: discourse salience , a theory that combines local grammatical information with a more global structure that reflects the hierarchy of discourse information, andadjoining tree grammars abbreviated as TAG. It is a model whose power of generation places it between non-contextual languages and contextual languages . These grammars have proven to be a model that has many applications. Moreover, the formalism is equivalent to other models, such as Carl Pollard 's Head grammar.
Publications (selection)
- Rashmi Prasad, Bonnie Webber, and Arvind Joshi, “ Reflections on the Penn Discourse TreeBank, Comparable Corpora, and Complementary Annotation,” Computational Linguistics , vol. 40, No. ,, p. 921-950 ( DOI 10.1162/coli_a_00204 ).
- Arvind K. Joshi, Leon S. Levy, and Masako Takahashi, “ Tree adjunct grammars ,” Journal of Computer and System Sciences , vol. 10, No. ,, p. 136-163 ( DOI 10.1016/s0022-0000(75)80019-5 ).
- David J. Weir, K. Vijay-Shanker and Arvind K. Joshi, “The Relationship Between Tree Adjoining Grammars And Head Grammars” , in 24th Annual Meeting of the Association for Computational Linguistics , Columbia University, New York, ACL,, p. 67-74,
- K. Vijay-Shanker, David J. Weir and Arvind K. Joshi, “Characterizing Structural Descriptions produced by Various Grammatical Formalism” , in 25th Annual Meeting of the Association for Computational Linguistics , Stanford University, Stanford, ACL,, p. 104-111
- Arvind K. Joshi and K. Vijay-Shanker, “Parsing tree adjoining grammars” , in A Perspective in Theoretical Computer Science. Commemorative Volume for Gift Siromoney , World Scientific, coll. “Series in Computer Science Volume 16”, ( DOI 10.1142/9789814368452_0006 ) , p. 95-105
Prizes and Awards
- 1971–72: Guggenheim Fellowship.
- 1976: Fellow of the Institute of Electrical and Electronics Engineers (IEEE).
- 1987: Best Paper Award at the National Conference on Artificial Intelligence .
- 1990: Founding Fellow of the Association for the Advancement of Artificial Intelligence (AAAI).
- 1997: IJCAI Award for Research Excellence .
- 1998: Fellow of the Association for Computing Machinery
- 1999: Fellow of the United States National Academy of Engineering .
- 2002: First recipient of the ACL 's Lifetime Achievement Award , a prize given at the association 's 40th anniversary meeting.
- 2003: Rumelhart Prize .
- 2003: Doctor honoris causa from Paris-Diderot University .
- 2005: Benjamin Franklin Medal , “ for his fundamental contributions to our understanding of how language is represented in the mind, and for developing techniques that enable computers to process efficiently the wide range of human languages. These advances have led to new methods for computer translation. » .
- 2013: Honorary Doctorate in Mathematics and Physics from Charles University in Prague
- 2013: Sige-Yuki Kuroda Prize of the " special interest group " of mathematics of the language of the ACL
