메뉴 건너뛰기




Volumn 11, Issue 4, 1997, Pages 289-298

Quantifying target-realization differences. Part II: Sequences

Author keywords

Clinical; Distance; Levenshtein; Phonology

Indexed keywords

ARTICLE; LINGUISTICS; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; SOUND; SPEECH ANALYSIS; SPEECH ARTICULATION;

EID: 0030790064     PISSN: 02699206     EISSN: None     Source Type: Journal    
DOI: 10.3109/02699209708985196     Document Type: Article
Times cited : (2)

References (16)
  • 2
    • 0038846320 scopus 로고
    • Basingstoke: Macmillan
    • CARR, P. (1993) Phonology (Basingstoke: Macmillan).
    • (1993) Phonology
    • Carr, P.1
  • 4
    • 8544231302 scopus 로고
    • Theoretical linguistics and clinical assessment
    • M. J. Ball (Ed.), London: Croom Helm
    • CONNOLLY, J. H. (1988) Theoretical linguistics and clinical assessment. In M. J. Ball (Ed.), Theoretical Linguistics and Disorders Language (London: Croom Helm).
    • (1988) Theoretical Linguistics and Disorders Language
    • Connolly, J.H.1
  • 5
    • 8544220303 scopus 로고
    • Functional linguistic analysis and the planning of remediation
    • P. Grunwell and A. James (Eds), London: Croom Helm
    • CONNOLLY, J. H. (1989) Functional linguistic analysis and the planning of remediation. In P. Grunwell and A. James (Eds), The Functional Evaluation of Language Disorders (London: Croom Helm).
    • (1989) The Functional Evaluation of Language Disorders
    • Connolly, J.H.1
  • 7
    • 84976659284 scopus 로고
    • Approximate string matching
    • HALL, P. A. V. and DOWLING, G. R. (1980) Approximate string matching. Computer Surveys, 12, 381-402.
    • (1980) Computer Surveys , vol.12 , pp. 381-402
    • Hall, P.A.V.1    Dowling, G.R.2
  • 10
    • 0019437136 scopus 로고
    • An effective algorithm for string correction using generalised edit distances. I: Description of the algorithm and its optimality
    • KASHYAP, R. L. and OOMMEN, B. J. (1981) An effective algorithm for string correction using generalised edit distances. I: Description of the algorithm and its optimality. Information Sciences, 23, 123-142.
    • (1981) Information Sciences , vol.23 , pp. 123-142
    • Kashyap, R.L.1    Oommen, B.J.2
  • 15
    • 0016921038 scopus 로고
    • A method for the correction of garbled words based on the Levenshtein metric
    • OKUDA, T., TANAKA, E. and KASAI, T. (1976) A method for the correction of garbled words based on the Levenshtein metric. IEEE Transactions on Computers, C-25, 172-178.
    • (1976) IEEE Transactions on Computers , vol.C-25 , pp. 172-178
    • Okuda, T.1    Tanaka, E.2    Kasai, T.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.