Did I find the right examples for you? yes no      Crawl my project      Python Jobs

All Samples(4)  |  Call(4)  |  Derive(0)  |  Import(0)
found matching level names for the given mapname (which can either
be a level name or map name)
If no exact match is found, then return close candidates using soundex
and then LevenshteinDistance algoritms

src/b/3/b3-1.9.2/b3/parsers/moh.py   b3(Download)
 
        if map not in supportedMaps:
            match = self.getMapsSoundingLike(map)
            if len(match) == 1:
                map = match[0]

src/b/i/big-brother-bot-HEAD/b3/parsers/moh.py   big-brother-bot(Download)
 
        if map not in supportedMaps:
            match = self.getMapsSoundingLike(map)
            if len(match) == 1:
                map = match[0]

src/b/3/b3-1.9.2/b3/parsers/bfbc2.py   b3(Download)
        supportedMaps = self.getSupportedMaps()
        if map not in supportedMaps:
            match = self.getMapsSoundingLike(map)
            if len(match) == 1:
                map = match[0]

src/b/i/big-brother-bot-HEAD/b3/parsers/bfbc2.py   big-brother-bot(Download)
        supportedMaps = self.getSupportedMaps()
        if map not in supportedMaps:
            match = self.getMapsSoundingLike(map)
            if len(match) == 1:
                map = match[0]