[B! trie] uokadaã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

uokada id:uokada

trieã«é–¢ã™ã‚‹uokadaã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (7)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

Darts: Double ARray Trie System
Darts: Double-ARray Trie System ã¯ã˜ã‚ã« Darts ã¯, Double-Array [Aoe 1989]ã‚’æ§‹ç¯‰ã™ã‚‹ãŸã‚ã® ã‚·ãƒ³ãƒ—ãƒ«ãª C++ Template Library ã§ã™. Double-Array ã¯ Trie ã‚’è¡¨ç¾ã™ã‚‹ãŸã‚ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™. ãƒãƒƒã‚·ãƒ¥æœ¨, ãƒ‡ã‚¸ã‚¿ãƒ«ãƒˆãƒ©ã‚¤, ãƒ‘ãƒˆãƒªã‚·ã‚¢æœ¨, Suffix Array ã«ã‚ˆã‚‹æ“¬ä¼¼ Trieã¨ã„ã£ãŸ ä»–ã® Trie ã®å®Ÿè£…ã«æ¯”ã¹é«˜é€Ÿã«å‹•ä½œã—ã¾ã™. ã‚ªãƒªã‚¸ãƒŠãƒ« ã® Double-Arrayã¯, å‹•çš„ã« key ã®è¿½åŠ å‰Šé™¤ã‚’è¡Œãˆã‚‹ã‚ˆã†ãª æž çµ„ã§ã™ãŒ, Darts ã¯ ã‚½ãƒ¼ãƒˆæ¸ˆã®è¾žæ›¸ã‚’ä¸€æ‹¬ã—ã¦Double-Array ã«å¤‰æ›ã™ã‚‹ã“ã¨ã«æ©Ÿèƒ½ã‚’çµžã£ã¦ã„ã¾ã™. ãƒãƒƒã‚·ãƒ¥ã®ã‚ˆã†ãªå˜ç´”ãªè¾žæ›¸ã¨ã—ã¦ä½¿ã†ã“ã¨ã‚‚å¯èƒ½ã§ã™ãŒ, å½¢æ…‹ç´ è§£æžå™¨ã®è¾žæ›¸ã«å¿…é ˆã® Common Prefix Search ã‚’éžå¸¸ã«é«˜é€Ÿã«è¡Œã†ã“ã¨ãŒ
uokada 2013/01/07
array

trie

algorithm

library
ãƒªãƒ³ã‚¯
Dynamic Double-Array Library
ãƒ€ãƒ–ãƒ«é…åˆ— ï¼ˆ Double-Array ï¼‰ ã¨ã¯ï¼Œ ãƒˆãƒ©ã‚¤ ï¼ˆ Trie ï¼‰ ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ä¸€ã¤ã§ï¼Œ ã€Œå°ã•ã„è¾žæ›¸ã§é«˜é€Ÿãªæ¤œç´¢ã€ãŒç‰¹é•·ã«ãªã‚Šã¾ã™ï¼Ž ãƒˆãƒ©ã‚¤ã‚’è¡¨ç¾ã—ãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ã‹ã‚‰ï¼Œ ã€Œå…¥åŠ›æ–‡å—åˆ—ã®å‰æ–¹éƒ¨åˆ†åˆ—ã¨ä¸€è‡´ã™ã‚‹ã‚ãƒ¼ã®æ¤œç´¢ã€ãŒå¯èƒ½ã§ã™ï¼Ž ä½¿ã„æ–¹ã¨ã—ã¦ã¯ï¼Œãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚°ã‚„æ§‹æ–‡è§£æžï¼Œå½¢æ…‹ç´ è§£æžãªã©ãŒã‚ã‚Šã¾ã™ï¼Ž ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã¨ã—ã¦ã¯ï¼ŒãŠãã‚‰ã Darts ãŒæœ‰åã§ã™ï¼Ž Darts: Double-ARay Trie System
uokada 2012/06/10
trie

library
ãƒªãƒ³ã‚¯
ã‚ªãƒ¼ãƒ—ãƒ³ã‚½ãƒ¼ã‚¹ã®Trieãƒ©ã‚¤ãƒ–ãƒ©ãƒªã¾ã¨ã‚ - nokunoã®æ—¥è¨˜
æœ€è¿‘ã€è¶£å‘³ã§é–‹ç™ºã—ã¦ã„ã‚‹StaKKã®ãŸã‚ã«Trieãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚’æ›¸ã„ã¦ã„ã‚‹ã®ã§ã™ãŒã€å‚è€ƒã«ã™ã‚‹ãŸã‚ã‚ªãƒ¼ãƒ—ãƒ³ã‚½ãƒ¼ã‚¹ã®Trieãƒ©ã‚¤ãƒ–ãƒ©ãƒªã«ã¤ã„ã¦èª¿ã¹ã¾ã—ãŸã€‚ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’ç”¨ã„ãŸã‚‚ã®ãŒä¸å¿ƒã§ã™ã€‚ @hillbigæ°ã«ã‚ˆã‚‹ã‚‚ã® tx LOUDSã«ã‚ˆã‚‹åœ§ç¸®ã§ãƒ¡ãƒ¢ãƒªä½¿ç”¨é‡ã‚’å‰Šæ¸›ã—ãŸTrieãƒ©ã‚¤ãƒ–ãƒ©ãƒªã€‚ é–¢é€£è¨˜äº‹ï¼šTx: Succinct Trie Data Structure Engineering the LOUDS Succinct Tree Representation - å°„æ’ƒã—ã¤ã¤å‰è»¢ux txã®æ”¹è‰¯ç‰ˆã€‚tailã®åœ§ç¸®ã«ã‚ˆã‚Štxã®1/2ãã‚‰ã„ã®ã‚µã‚¤ã‚ºã«ãªã‚‹ã‚‰ã—ã„ã€‚è¦ãƒã‚§ãƒƒã‚¯ã€‚ é–¢é€£è¨˜äº‹ï¼šux... - ny23ã®æ—¥è¨˜id:s-yata æ°ã«ã‚ˆã‚‹ã‚‚ã® taiju LOUDSã‚’å«ã‚€ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’ç”¨ã„ãŸå¤§è¦æ¨¡Trieãƒ©ã‚¤ãƒ–ãƒ©ãƒªã€‚sumire-triesã‚¤ãƒ³ãƒ¡ãƒ¢ãƒªã®ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’å®Ÿè£…ã—ãŸå¤§è¦æ¨¡T
uokada 2012/06/10
trie

programming

algorithm

library
ãƒªãƒ³ã‚¯
Double-Array Articles
ãƒ€ãƒ–ãƒ«é…åˆ—ã®ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚’å…¬é–‹ã—ã¦ã„ã‚‹ãƒšãƒ¼ã‚¸ã§ã™ï¼Ž An Implementation of Double-Array Trie URL: http://linux.thai.net/~thep/datrie/datrie.html Darts: Double-ARray Trie System URL: http://chasen.org/~taku/software/darts/ Dame URL: http://www.void.in/wiki/Dame Tiny Double-Array Library URL: http://nanika.osonae.com/TinyDA/index.html Dynamic Double-Array Library URL: http://nanika.osonae.com/DynDA/index.html
uokada 2012/06/10
algorithm

library

trie
ãƒªãƒ³ã‚¯
Double Array å®Ÿè£…ã—ã¦ã¿ãŸ - æœ¨æ›œä¸è¶³
ä»Šä½œã‚Šã‹ã‘ã®ã‚‚ã®ã§ã€ç´ æ€§(æ–‡å—åˆ—ç‰‡)ã‚’æ ¼ç´ã™ã‚‹ã®ã« Trie ã‚’ä½¿ã£ã¦ã„ãŸã®ã ã‘ã©ã€50ä¸‡ä»¶ã‚’è¶…ãˆãŸã‚ãŸã‚Šã‹ã‚‰ãƒ¡ãƒ¢ãƒªã«è¼‰ã‚‰ãªããªã£ã¦ãã¦ã€‚ ã¾ã‚ dict ã‚’ä½¿ã£ãŸã‚ã¡ã‚ƒã‚ã¡ã‚ƒãƒŠã‚¤ãƒ¼ãƒ–ãªå®Ÿè£…ã ã£ãŸã®ã§ã€ãã‚ãã‚ãƒ€ãƒ¡ã‹ãªã‚ã¨ã¯æ€ã£ã¦ã„ãŸã‚“ã ã‘ã©(è‹¦ç¬‘)ã€‚ ã¨ã„ã†ã‚ã‘ã§ã€ãã‚Œã‚ˆã‚Šãã£ã¨çœã‚¹ãƒšãƒ¼ã‚¹ï¼†ãã£ã¨é«˜é€Ÿã ã‚ã†ã¨æœŸå¾…ã—ã¦ Double Array ã‚’ Python ã§å®Ÿè£…ã—ã¦ã¿ãŸã€‚ å‚è€ƒã«ã—ãŸã®ã¯ WEB+DB Press vol. 64 ã®å¾³æ°¸ã•ã‚“ã®è¨˜äº‹ã€‚ ç¾æ™‚ç‚¹ã§ã®å®Ÿè£…ãŒã“ã¡ã‚‰ã€‚ https://github.com/shuyo/iir/blob/master/trie/da.py ã‚½ãƒ¼ãƒˆæ¸ˆã¿ã®ãƒ†ã‚ã‚¹ãƒˆåˆ—ã‚’ä¸Žãˆã‚‹ã¨ã€Double Array ã‚’æ§‹ç¯‰ã€‚ get ã‚’å‘¼ã³å‡ºã™ã¨ã€æœ€åˆã«ä¸ŽãˆãŸãƒ†ã‚ã‚¹ãƒˆåˆ—ã®ä¸ã§ã®ã‚ãƒ¼æ–‡å—åˆ—ã®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã‚’è¿”ã™ã€‚ ã‚·ãƒ³ãƒ—ãƒ«æ©Ÿèƒ½ã€‚ trie = da.DoubleAr
uokada 2012/04/10
trie

algorithm

doublearray
ãƒªãƒ³ã‚¯
Ruby ã§ Double-Array ã‚’å®Ÿè£…ã—ã¦ Common-Prefix Search ã‚’è©¦ã—ã¦ã¿ã‚‹ - P A R A G R A P H S
lib/trie/double_array.rb at master from tily's ruby-gardening - GitHub Double-Array (ãƒ€ãƒ–ãƒ«é…åˆ—) ã¯ ãƒˆãƒ©ã‚¤æœ¨ã‚’å®Ÿè£…ã™ã‚‹ãŸã‚ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã® 1 ã¤ã§ã€ä»–ã®å®Ÿè£…ã‚ˆã‚Šã‚‚é«˜é€Ÿã« TRIE ã‹ã‚‰æ–‡å—åˆ—ã‚’æ¤œç´¢ã§ãã‚‹ã‚‰ã—ã„ã€‚ChaSen ã‚„ MeCab ã§ã€å½¢æ…‹ç´ è§£æžã‚’è¡Œã†ãŸã‚ã«å¿…è¦ãª Common-Prefix Search (å…±é€šæŽ¥é è¾žæŽ¢ç´¢) ã‚’è¡Œã†ãŸã‚ã«ä½¿ã‚ã‚Œã¦ã„ã‚‹ã€‚ã“ã‚Œã‚’ç†è§£ã®ãŸã‚ã« Ruby ã§å®Ÿè£…ã—ã¦ã¿ãŸã€‚ åŸºæœ¬çš„ãªå‹•ä½œç¢ºèª ã“ã“ã«æ›¸ã„ã¦ã‚ã‚‹ bird, bison, cat ã® 3 å˜èªžã§æ§‹ç¯‰ã—ãŸ Double-Array ã®ä¾‹ã€‚ ã‚³ãƒ¼ãƒ‰ï¼š require 'trie/double_array' da = Trie::DoubleArray.new da.build(%w|bird bison cat
uokada 2012/04/10
algorithm

doublearray

trie
ãƒªãƒ³ã‚¯
æœ€è¿‘ã®DoubleArrayã®æ€§èƒ½ - å°„æ’ƒã—ã¤ã¤å‰è»¢ æ”¹
DoubleArrayã®æ€§èƒ½ã«é–¢ã—ã¦ã€æœ€è¿‘ã¯å°‘ã—æ”¹å–„ã•ã‚Œã¦ã„ã‚‹ã‹ã‚‚çŸ¥ã‚Œã¾ã›ã‚“ã¨ã‚ã‚‹ã®ã§ã€å…·ä½“çš„ã«ã©ã‚Œãã‚‰ã„æ”¹å–„ã•ã‚Œã¦ã„ã‚‹ã®ã‹ã€å°‘ã—æ›¸ã„ã¦ã¿ã¾ã™ã€‚ã‚‚ã¡ã‚ã‚“ã€ç¾å®Ÿé€ƒé¿ã§ã™ã€‚ ã¾ãšã€DoubleArrayãŒãªã‚“ãªã®ã‹ã¨ã„ã†ã¨ã“ã‚ã‹ã‚‰èª¬æ˜Žã‚’ã—ã¾ã™ã€‚DoubleArrayã¯ã€ç°¡å˜ã«è¨€ã†ã¨Trieã‚’å®Ÿç¾ã™ã‚‹ãŸã‚ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ä¸€ç¨®ã§ã™ã€‚æ—¥æœ¬èªžã§ã¯ãƒ€ãƒ–ãƒ«é…åˆ—ã¨å‘¼ã°ã‚Œã¦ã„ã‚‹ã‚ˆã†ã§ã™ã€‚Trieã«é–¢ã—ã¦ã¯æ¨ªç€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° ç¬¬6å›ž: chatty: å°ã†ã‚‹ã•ã„ç«¯æœ«ã‚ãŸã‚Šã‚’èªã‚ã°è‰¯ã„ã§ã—ã‚‡ã†ã‹ã€‚è¦ã™ã‚‹ã«Treeã‚’è¡¨ç¾ã™ã‚‹ãŸã‚ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ã€‚ä½¿ã„é“ã¯ã„ã‚ã„ã‚ã‚ã‚Šã¾ã™ãŒã€è¾žæ›¸çš„ãªã‚‚ã®ã«ä½¿ã‚ã‚Œã‚‹ã“ã¨ãŒå¤šã„ã§ã—ã‚‡ã†ã‹ã€‚ Trieã‚’å˜ç´”ã«å®Ÿç¾ã—ã‚ˆã†ã¨ã™ã‚‹ã¨ã€ã™ã”ããŸãã•ã‚“ãƒ¡ãƒ¢ãƒªã‚’ä½¿ã£ã¦ã™ã”ãé€Ÿã„å®Ÿè£…ã‚’ã™ã‚‹ã‹ã€é€Ÿåº¦ã‚’å¤šå°‘çŠ ç‰²ã«ã—ã¦ãƒ¡ãƒ¢ãƒªæ¶ˆè²»é‡ã‚’å‰Šæ¸›ã™ã‚‹ã‹ã®é¸æŠžã‚’è¿«ã‚‰ã‚Œã¾ã™ã€‚å¤šãã®å ´åˆã¯ãƒ¡ãƒ¢ãƒªã‚’ç¯€ç´„ã—ãªã„ã¨ä½¿ã„ã‚‚ã®ã«ãªã‚‰ãªã„
uokada 2012/04/10
algorithm

doublearray

trie
ãƒªãƒ³ã‚¯
1