C++: 編集è·é›¢ã‚’求ã‚るアルゴリズム編集è·é›¢(edit distance)ã¨ã¯äºŒã¤ã®æ–‡å—列ãŒã©ã®ç¨‹åº¦ç•°ãªã£ã¦ã„ã‚‹ã‹ã‚’示ã™æ•°å€¤ã§ã‚ã‚Šã€ãƒ¬ãƒ¼ãƒ™ãƒ³ã‚·ãƒ¥ã‚¿ã‚¤ãƒ³è·é›¢(Levenshtein distance)を指ã™ã“ã¨ãŒå¤šã„。文å—ã®æŒ¿å…¥ã€å‰Šé™¤ã€ç½®æ›ãã‚Œãžã‚Œã‚’一ã¤ã®æ“作ã¨ã—ã¦å¿…è¦ãªæ“作ã®æœ€å°æ•°ã‚’求ã‚ã‚‹ã‚‚ã®ã 。例ãˆã°ã€kittenã¨sittingã®ç·¨é›†è·é›¢ã‚’求ã‚ã‚‹å ´åˆã€ä¸‹è¨˜ã®ã‚ˆã†ã«3回ã®æ“作ã§kittenã‚’sittingã«å¤‰æ›´ã§ãã‚‹ã®ã§ç·¨é›†è·é›¢ã¯3ã¨ãªã‚‹ã€‚ 1. sitten (k ã‚’ s ã«ç½®æ›ï¼‰ 2. sittin (e ã‚’ i ã«ç½®æ›ï¼‰ 3. sitting (g を挿入) ãã“ã§ä»Šå›žã¯ç·¨é›†è·é›¢ã‚’求ã‚る複数ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦C++ã§å®Ÿè£…ã—ã¦ã¿ãŸã€‚ 動的計画法 編集è·é›¢ã‚’求ã‚ã‚‹ã‚‚ã£ã¨ã‚‚一般的ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã€å‹•çš„計画法(dynamic programming)ã ã‚ã†ã€‚計算時間ã¯O(mn)ã§ã‚ã‚Šã€æ‰‹è»½ã 。C++ã§æ›¸ã„ãŸã‚³ãƒ¼ãƒ‰ã‚’下ã«ç¤º
[プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°] ビット並列アルゴリズムを使ã£ãŸç·¨é›†è·é›¢ - tsubosakaã®æ—¥è¨˜![[プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°] ビット並列アルゴリズムを使ã£ãŸç·¨é›†è·é›¢ - tsubosakaã®æ—¥è¨˜](https://cdn-ak-scissors.b.st-hatena.com/image/square/7ca3ca3d9a967967d3c1900062079765c7d58c98/height=288;version=1;width=512/https%3A%2F%2Fcdn.image.st-hatena.com%2Fimage%2Fscale%2F3b21b9940827376b8faf757c1dcc041507e62d8d%2Fbackend%3Dimagemagick%3Bversion%3D1%3Bwidth%3D1300%2Fhttps%253A%252F%252Fcdn-ak.f.st-hatena.com%252Fimages%252Ffotolife%252Ft%252Ftsubosaka%252F20091103%252F20091103000001.jpg)
{{#tags}}- {{label}}
{{/tags}}